On Symmetric Compound Decision Rules for Dichotomies
نویسندگان
چکیده
منابع مشابه
Complexity Dichotomies for Unweighted Scoring Rules
Scoring systems are an extremely important class of election systems. We study the complexity of manipulation, constructive control by deleting voters (CCDV), and bribery for scoring systems. For manipulation, we show that for all scoring rules with a constant number of different coefficients, manipulation is in P. And we conjecture that there is no dichotomy theorem. On the other hand, we obta...
متن کاملA Compound Decision Support System for Corporate Planning
Providing a plan for any corporate or firm at macro level, as an organization or enterprise resource planning has particular importance nowadays. To meet the enterprise resource planning needs applications software packages provide a set of uniform pre-prepared and pre-designed that covers all business process throughout an organization. To achieve maximum efficiency in the implementation of th...
متن کاملOracle and Adaptive Compound Decision Rules for False Discovery Rate Control
We develop a compound decision theory framework for multiple-testing problems and derive an oracle rule based on the z values that minimizes the false nondiscovery rate (FNR) subject to a constraint on the false discovery rate (FDR). We show that many commonly used multiple-testing procedures, which are p value–based, are inefficient, and propose an adaptive procedure based on the z values. The...
متن کاملStable Branching Rules for Classical Symmetric Pairs
Given completely reducible representations, V and W of complex algebraic groups G and H respectively, together with an embedding H →֒ G, we let [V,W ] = dimHomH (W,V ) where V is regarded as a representation of H by restriction. If W is irreducible, then [V,W ] is the multiplicity of W in V . This number may of course be infinite if V or W is infinite dimensional. A description of the numbers [V...
متن کاملOn Metric Ramsey-type Dichotomies
The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the form ”Every finite metric space contains a large subspace that is nearly equilateral or far from being equilateral”. We consider two distinct interpretations fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1974
ISSN: 0090-5364
DOI: 10.1214/aos/1176342626